Problems Complete for Deterministic Logarithmic Space
نویسندگان
چکیده
* We exhibit several problems complete for deterministic logarithmic space under NC' (i.e., log depth) reducibility. The list includes breadth-first search and depth-first search of an undirected tree, connectivity of undirected graphs known to be made up of one or more disjoint cycles, undirected graph acyclicity, and several problems related to representing and to operating with permutations of a finite set. Q 1987 Academic Press, Inc.
منابع مشابه
CS 710 : Complexity Theory 1 / 28 / 2010 Lecture 4 : Time - Bounded Nondeterminism
In the previous lecture, we discussed NP-completeness and gave some strong results pertaining to the complexity of SAT, viz. that it is complete for NP under a reduction computable in logarithmic space and polylogarithmic time, and that it is complete for NQLIN (the set of NP problems solvable in quasilinear time) under quasi-linear time mapping reductions. The conclusion that all naturally occ...
متن کاملQuantum versus Classical Online Algorithms with Advice and Logarithmic Space
In this paper, we consider online algorithms. Typically the model is investigated with respect to competitive ratio. We consider algorithms with restricted memory (space) and explore their power. We focus on quantum and classical online algorithms. We show that there are problems that can be better solved by quantum algorithms than classical ones in a case of logarithmic memory. Additionally, w...
متن کاملUndirected St-connectivity in Log Space 2 Expander Graphs 2.1 What Are Expanders?
The problem of interest in this lecture is undirected st connectivity. For a given graph G and two vertices s and t, determine whether there exists a path connecting s and t in G. By using any kind of algorithm for finding a shortest path from s to t, this problem can be solved trivially in polynomial time. But in this lecture, we are not going to consider the running time, instead, we will ans...
متن کاملL-Recursion and a new Logic for Logarithmic Space
We extend first-order logic with counting by a new operator that allows it to formalise a limited form of recursion which can be evaluated in logarithmic space. The resulting logic LREC has a data complexity in LOGSPACE, and it defines LOGSPACE-complete problems like deterministic reachability and Boolean formula evaluation. We prove that LREC is strictly more expressive than deterministic tran...
متن کاملLecture 18 Lecturer
In this lecture we present the relatively recent fundamental result of O. Reingold [3] which establishes that undirected st-connectivity can be decided in deterministic logarithmic space. Given an undirected graph G, two vertices s and t in G, USTCON(G, s, t) is the problem of deciding whether there exists a path in G connecting s and t. The more difficult, directed graph version of this proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Algorithms
دوره 8 شماره
صفحات -
تاریخ انتشار 1987